Improved Monte Carlo algorithm of phonon transport in semiconductor nanodevices
نویسندگان
چکیده
منابع مشابه
Adjoint-based deviational Monte Carlo methods for phonon transport calculations
In the field of linear transport, adjoint formulations exploit linearity to derive powerful reciprocity relations between a variety of quantities of interest. In this paper, we develop an adjoint formulation of the linearized Boltzmann transport equation for phonon transport. We use this formulation for accelerating deviational Monte Carlo simulations of complex, multiscale problems. Benefits i...
متن کاملAn Improved Monte Carlo Factorization Algorithm
Pollard’s Monte Carlo factorization algorithm usually finds a factor of a composite integer N in O(N1/4) arithmetic operations. The algorithm is based on a cycle-finding algorithm of Floyd. We describe a cycle-finding algorithm which is about 36 percent faster than Floyd’s (on the average), and apply it to give a Monte Carlo factorization algorithm which is similar to Pollard’s but about 24 per...
متن کاملImproved electron transport mechanics in the PENELOPE Monte-Carlo model
We describe a new model of electron transport mechanics, the method by which an electron is transported geometrically in an in®nite medium as a function of pathlength, s, the accumulated elastic multiple-scattering angular de ̄ection characterized by H s, the polar scattering angle, and U, a random azimuthal angle. This model requires only one sample of the multiple-scattering angle yet it repr...
متن کاملMiniband quantum transport in semiconductor nanodevices under broadband illumination
A general theoretical framework for the modelling of miniband transport in semiconductor nanostructures under broadband illumination is presented. Our approach is based on the multi-subband three-dimensional Boltzmann transport equation and allows to investigate both the steady-state and the time-dependent dynamics. The model has been succesfully applied to the problem of the design and optimiz...
متن کاملImproved Monte-Carlo Search
Monte-Carlo search has been successful in many non-deterministic games, and recently in deterministic games with high branching factor. One of the drawbacks of the current approaches is that even if the iterative process would last for a very long time, the selected move does not necessarily converge to a game-theoretic optimal one. In this paper we introduce a new algorithm, UCT, which extends...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2007
ISSN: 1742-6596
DOI: 10.1088/1742-6596/92/1/012079